Remarks on formalized proof and consequence
نویسندگان
چکیده
منابع مشابه
Some Remarks on Axiomatizing Logical Consequence Operations
In this paper we investigate the relation between the axiomatization of a given logical consequence operation and axiom systems defining the class of algebras related to that consequence operation. We show examples which prove that, in general there are no natural relation between both ways of axiomatization.
متن کاملSome Remarks on Proof-Theoretic Semantics
This is a tripartite work. The first part is a brief discussion of what it is to be a logical constant, rejecting a view that allows a particular self-referential “constant” • to be such a thing in favour of a view that leads to strong normalisation results. The second part is a commentary on the flattened version of Modus Ponens, and its relationship with rules of type theory. The third part i...
متن کاملFormalized Proof, Computation, and the Construction Problem in Algebraic Geometry
It has become a classical technique to turn to theoretical computer science to provide computational tools for algebraic geometry. A more recent transformation is that now we also get logical tools, and these too should be useful in the study of algebraic varieties. The purpose of this note is to consider a very small part of this picture, and try to motivate the study of computer theorem-provi...
متن کاملA New and Formalized Proof of Abstract Completion
Completion is one of the most studied techniques in term rewriting. We present a new proof of the correctness of abstract completion that is based on peak decreasingness, a special case of decreasing diagrams. Peak decreasingness replaces Newman’s Lemma and allows us to avoid proof orders in the correctness proof of completion. As a result, our proof is simpler than the one presented in textboo...
متن کاملRemarks and Replies A Simple Proof
Adapting arguments from Eisner 1997, 2000, this remark provides a simple proof that the generation problem for Optimality Theory (Prince and Smolensky 2004) is NP-hard. The proof needs only the binary evaluation of constraints and uses only constraints generally employed in the Optimality Theory literature. In contrast, rule-based derivational systems are easily computable, belonging to the cla...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 1969
ISSN: 0039-3215,1572-8730
DOI: 10.1007/bf02297288